A System of Interaction and Structure II: The Need for Deep Inference

This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports deep inference, in which inference rules can be applied anywhere inside logical expressions. The use of deep inference results in a simple logical system for MLL extended with the self-dual non-commutative operator, which has been to date not known to be expressible in sequent calculus. In this paper, deep inference is shown to be crucial for the logic BV, that is, any restriction on the ``depth'' of the inference rules of BV would result in a strictly less expressive logical system

Cut-free Calculi and Relational Semantics for Temporal STIT Logics

We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3Tstit are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also Xstit can be characterized through relational frames, omitting the use of BT+AC frames

EPR-Like “Funny Business” in the Theory of Branching Space-Times

EPR-like phenomena are (presumably) indeterministic, but they furthermore suggest that our world involves seeming-strange ``funny business.'' Without invoking any heavy mathematics, the theory of branching space-times offers two apparently quite different ways in which EPR-like funny business goes beyond simple indeterminism. (1) The first is a modal version of a Bell-like correlation: There exist two space-like separated indeterministic initial events whose families of outcomes are nevertheless modally correlated. That is, although the occurrence of each outcome of each of the two space-like separated initial events is separately possible, some joint occurrence of their outcomes (one from each) is impossible. (2) The second sounds like superluminal causation: A certain initial event can bear a cause-like relation to a certain without being in the causal past of that outcome. The two accounts of EPR-like funny business are proved equivalent, a result that supports the claim of each as useful to mark the line between mere indeterminism and EPR-like funny business. This is a ``postprint'' based on the version published in Non-locality and modality, T. Placek and J. Butterfield eds., Kluwer Academic Publishers, Dordrecht, 2002, pp. 293--315. The archive at http://philsci-archive.pitt.edu contains two recent related articles by the author, ``No-common-cause EPR-like funny business in branching space-times'' (2002) and ``A theory of causation: causae causantes (originating causes) as inus conditions in branching space-times'' (2002)

The open future, bivalence and assertion

It is highly intuitive that the future is open and the past is closed—whereas it is unsettled whether there will be a fourth world war, it is settled that there was a first. Recently, it has become increasingly popular to claim that the intuitive openness of the future implies that contingent statements about the future, such as ‘there will be a sea battle tomorrow,’ are non-bivalent (neither true nor false). In this paper, we argue that the non-bivalence of future contingents is at odds with our pre-theoretic intuitions about the openness of the future. These are revealed by our pragmatic judgments concerning the correctness and incorrectness of assertions of future contingents. We argue that the pragmatic data together with a plausible account of assertion shows that in many cases we take future contingents to be true (or to be false), though we take the future to be open in relevant respects. It follows that appeals to intuition to support the non-bivalence of future contingents is untenable. Intuition favours bivalence

Is Quantum Mechanics Compatible with an Entirely Deterministic Universe?

A b s t r a c t It will be argued that 1) the Bell inequalities are not equivalent with those inequalities derived by Pitowsky and others that indicate the Kolmogorovity of a probability model, 2) the original Bell inequalities are irrelevant to both the question of whether or not quantum mechanics is a Kolmogorovian theory as well as the problem of determinism, whereas 3) the Pitowsky type inequalities are not violated by quantum mechanics, hence 4) quantum mechanics is a Kolmogorovian probability theory, therefore, 5) it is compatible with an entirely deterministic universe.Comment: 15 pages, (compressed and uuencoded) Postscript (188 kb), preprint 94/0

The Invisible Thin Red Line

The aim of this paper is to argue that the adoption of an unrestricted principle of bivalence is compatible with a metaphysics that (i) denies that the future is real, (ii) adopts nomological indeterminism, and (iii) exploits a branching structure to provide a semantics for future contingent claims. To this end, we elaborate what we call Flow Fragmentalism, a view inspired by Kit Fine (2005)’s non-standard tense realism, according to which reality is divided up into maximally coherent collections of tensed facts. In this way, we show how to reconcile a genuinely A-theoretic branching-time model with the idea that there is a branch corresponding to the thin red line, that is, the branch that will turn out to be the actual future history of the world

Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics

This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. In the single-agent case, we show that the refined calculi Ldm^m_nL derive theorems within a restricted class of (forestlike) sequents, allowing us to provide proof-search algorithms that decide single-agent STIT logics. We prove that the proof-search algorithms are correct and terminate